Model-based logic design

ABSTRACT

A technique for designing a logic circuit includes specifying a model. The model including combinatorial blocks, state elements and graphical library elements. The technique maintains a data structure representative of the model, and generates an architectural model and an implementation model from the data structure. The data structure represents a descriptive net list of the model. The architectural model includes C++ code and the implementation model includes Verilog.

TECHNICAL FIELD

[0001] This invention relates to model-based logic design.

BACKGROUND

[0002] Microprocessor logic design typically includes an architectural stage and an implementation stage.

[0003] The architectural stage includes designing a framework of functional units that provide performance and functionality of a new microprocessor. This framework is typically captured in a text-based document. A model of the new microprocessor, represented in a high level language such as C++, is generated to verify that the function and performance requirements are met.

[0004] The implementation stage involves taking the model and the text-based document from the architectural stage and generating a Hardware Design Language (HDL) file.

DESCRIPTION OF DRAWINGS

[0005]FIG. 1 shows a system.

[0006]FIG. 2 shows a graphical model.

[0007]FIG. 3 shows a data structure.

[0008]FIG. 4 shows a logic modeling process.

DETAILED DESCRIPTION

[0009] Referring to FIG. 1, a system 10 includes a computer 12, such as a personal computer (PC). The computer 12 may be connected to a network 14, such as the Internet, that runs TCP/IP (Transmission Control Protocol/Internet Protocol) or another suitable protocol. Connections may be via Ethernet, wireless link, or telephone line.

[0010] The computer 12 contains a processor 16 and a memory 18. Memory 18 stores an operating system (O/S) 20 such as Windows2000® or Linux, a TCP/IP protocol stack 22 for communicating over network 14, and machine-executable instructions 24 executed by processor 16 to perform a logic modeling process 100 below. The computer 12 also includes an input/output (I/O) device 26 for display of a graphical user interface (GUI) 28 to a user 30 and a storage device 32 for storing a database 34.

[0011] The logic modeling process 100 executes in the computer 12. The logic modeling process 100 is a process in which a C++ model file and a Hardware Design Language (HDL) file, such as a Verilog (IEEE Standard 1364) file or a Very high speed integrated circuit Hardware Design Language (VHDL) (IEEE Standard 1076) file, are generated from a successively refined graphical model. Verilog is a hardware description language, a textual format for describing electronic circuits and systems, applied to electronic design. Verilog is used for verification through simulation, for timing analysis, for test analysis (testability analysis and fault grading) and for logic synthesis.

[0012] Referring to FIG. 2, a graphical model 50 is a pictorial model of a microprocessor design. The graphical model 50 is a tool that blends the use of textual description and graphical description of logical elements to hierarchically capture a silicon design. The use of graphics is important to “re-use” capability and for design support. The graphical model 50 is represented in database 34 to enable production of a cycle-accurate high performance simulation model as well as a synthesizable Verilog model.

[0013] The graphical model 50 includes of a set of blocks 52, interconnected by lines 54. Each of the blocks 52 represents logical elements of a device under design. The lines 54 represent connections of block inputs to block outputs. Every block in the graphical model 50 is an instance of a specific type of block. The type of block determines the relationship between a block's outputs and its inputs, states, and time. The graphical model 50 may contain any number of instances of any type of block needed to model a system.

[0014] Although not illustrated in FIG. 2, each of the blocks 52 and lines 54 are linked to a Register Transfer Diagram (RTD) descriptions allowing the user 30 to navigate and drill down to a particular place in the design quickly. This allows the user 30 to capture the design intent and then to successively refine the design. In a RTD view (not shown) of the graphical model 50 logic is color-coded. For example, state elements are shown in blue, semantically correct combinatorial logic is shown in green, common blocks describing pipe stages are shown in white, ports identifying inputs/outputs of the RTD are shown in yellow, and library elements with correctly matched inputs and outputs are shown in gray. Other schemes can also be used.

[0015] Each of the blocks 52 and corresponding lines 54 are stored in the database 34. More specifically, the blocks and corresponding connections are stored in one or more data structures that represent the gates, nodes and nets of the device. The data structures provide an internal list or description of a net list of the device is stored in the database 34.

[0016] Referring to FIG. 3, an exemplary data structure 60 implemented in C++ and stored in the database 34 and representing an exemplary description of a graphic model includes M-Gate (62), M_Pin (64), M_Net (66) and M_node (68), where “M” represents Model. The data structure may be implemented, for example, as a linked list or binary tree.

[0017] The M-Gate (62) represents a logical function, for example, AND, FF, FIFO, and so forth. The M_Gate (62) contains zero or more input pins (M_pin's) and zero or more output pins. Each distinct logical function in the graphical model 50 is assigned its own derived M_gate type.

[0018] The M_pin (64) represents a connection point to a gate. The connection may be either an input or output. It connects an M_gate to an M_net.

[0019] The M_node (66) represents the total extent (i.e. all bits) of a simulation state.

[0020] The M_Net (68) represents an arbitrary collection of bits within an M_node. An M_net connects one or more M_pin's together.

[0021] M-Gate (62), M_Pin (64), M_Net (66) and M_node (68) are all C++ classes in which there are multiple derived classes for each class listed above.

[0022] The data structure 60 is updated and reflects the current state of the graphical model 50. The data structure 60 is used by the logic modeling process 100 to generate an architectural model using, for example, C++ constraints, and a Verilog implementation model. Thus, a single database, i.e., the database 34, is used as generator of both an architectural and implementation model for a chip design.

[0023] Referring to FIG. 4, the logic modeling process 100 includes graphically capturing (102) combinatorial blocks, state elements and graphical library elements. Graphics elements in the library may be definable or may have predefined functions. For example, the library may contain software objects that perform the function of a FF or a latch. The library may also contain graphics elements that are undefined, i.e., that have no code associated with them.

[0024] A block in a graphical model may represent a single combinatorial element, such as a multiplexer or state element. A combinatorial block represents the functionality of several combinatorial elements or the function of several state elements.

[0025] The process 100 builds (104) a control/design analysis and checks (106) for errors. For example, process 100 determines if there are any un-terminated or inconsistent connections in the design. If any such problems are detected, process 100 issues an error message to the logic designer. The error message may specify the nature of the problem and its location within the logic design. The logic designer is then given the opportunity to correct the problem before process 100 moves forward.

[0026] The process 100 stores (108) the logic of the graphics capture in a data structure. The process 100 determines (110) whether to write an architectural model or implementation model. If an implementation model is to be written, the process 100 generates (112) Verilog using Verilog constructs to provide the implementation model.

[0027] If an architectural model is to be written, the process 100 coverts (114) the data structure into a C++ topology. The process provides (116) timing and clock domain assignments partitions (118) clock domain topologies. Each partition is coded ordered (120) and partition code provided to a C++ compiler.

[0028] Code ordering means that the logical constructs are sorted based on producer/consumer. BY subsequently code-ordering the C++ model may be simulated as a single call model. A single call model means that each logical construct is evaluated only once per cycle. Hence, the C++ model simulator is a cycle-based simulator. The Verilog model is also written after being extracted from the data structure and is typically simulated using an event driven simulator such as ModelSim™ from Model Technology, for example.

[0029] The process writes (122) C++ files, batch files and makefiles for the architectural model. Thus, process 100 generates high performance C++ and highly efficient Verilog from the same database.

[0030] Process 100 may be implemented using one or more computer programs executing on programmable computers that each includes a processor, a storage medium readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and one or more output devices.

[0031] Each such program may be implemented in a high level procedural or object-oriented programming language to communicate with a computer system. Also, the programs can be implemented in assembly or machine language. The language may be a compiled or an interpreted language.

[0032] Each computer program may be stored on a storage medium or device (e.g., CD-ROM, hard disk, or magnetic diskette) that is readable by a general or special purpose programmable computer for configuring and operating the computer when the storage medium or device is read by the computer to perform process 100.

[0033] Process 100 may also be implemented as a computer-readable storage medium, configured with a computer program, where, upon execution, instructions in the computer program cause the computer to operate in accordance with process 50.

[0034] Further aspects, features and advantages will become apparent from the following. 

What is claimed is:
 1. A method for designing a logic circuit comprising: maintaining a data structure representative of a model, the model including combinational blocks, state elements and graphical library elements of the logic circuit; and generating an architectural model and an implementation model from the data structure.
 2. The method of claim 1 wherein the data structure comprises a description of a net list.
 3. The method of claim 2 wherein the data structure comprises: elements representing logical functions; elements representing connection points to gates; elements representing all bits of a simulation state; and elements representing an arbitrary collection of bits within the simulation state.
 4. The method of claim 4 wherein the elements are all C++ classes.
 5. The method of claim 1 wherein the architectural model comprises C++ software code.
 6. The method of claim 1 wherein the implementation model comprises Hardware Design Language (HDL).
 7. The method of claim 6 wherein the HDL is Verilog.
 8. The method of claim 6 wherein the HDL is Very high speed integrated circuit Hardware Design Language (VHDL).
 9. A method comprising: specifying a model containing combinatorial blocks, state elements and graphical library elements; maintaining a descriptive net list of the model; and generating a C++ model and a Verilog model from the descriptive net list.
 10. The method of claim 9 further comprising displaying the model on a graphical user interface (GUI).
 11. The method of claim 9 wherein the net list comprises gates, nodes and nets.
 12. The method of claim 9 wherein maintaining comprises parsing and analyzing the combinatorial blocks, state elements and graphical library elements of the model.
 13. The method of claim 9 wherein generating comprises: partitioning a topology of the net list into a plurality of partitions; and code ordering each of the partitions.
 14. A computer program product residing on a computer readable medium having instructions stored thereon which, when executed by the processor, cause the processor to: specify a model containing combinatorial blocks, state elements and graphical library elements; maintain a descriptive net list of the model; and generate a C++ model and a Verilog model from the descriptive net list.
 15. The computer product of claim 14 wherein the computer readable medium is a random access memory (RAM).
 16. The computer product of claim 14 wherein the computer readable medium is a read only memory (ROM).
 17. The computer product of claim 14 wherein the computer readable medium is a hard disk drive.
 18. A processor and memory configured to: specify a model containing combinatorial blocks, state elements and graphical library elements; maintain a descriptive net list of the model; and generate a C++ model and a Verilog model from the descriptive net list.
 19. The processor and memory of claim 18 wherein the processor and memory are incorporated into a personal computer.
 20. The processor and memory of claim 18 wherein the processor and memory are incorporated into a network server residing in the Internet.
 21. The processor and memory of claim 18 wherein the processor and memory are incorporated into a single board computer.
 22. A system comprising: a graphic user interface (GUI) for receiving parameters from a user to generate a model and displaying the model, the model containing combinatorial blocks, state elements and graphical library elements; a maintenance process to manage a data structure representing a descriptive net list of the model; and a code generation process to generate a C++ model and a Verilog model from the data structure.
 23. The system of claim 22 wherein the data structure comprises gates, nodes and nets.
 24. The system of claim 22 wherein the maintenance process comprises parsing and analyzing the combinatorial blocks, state elements and graphical library elements of the model.
 25. The system of claim 22 wherein the code generation process comprises: partitioning a topology of the net list into a plurality of partitions; and code ordering each of the partitions.
 26. A data structure comprising: elements representing logical functions of a logic model; elements representing connection points to gates of the logic model; elements representing all bits of a simulation state of the logic model; and elements representing an arbitrary collection of bits within the simulation state of the logic model.
 27. The data structure of claim 26 wherein the elements are stored in a binary tree.
 28. The data structure of claim 26 wherein the elements are stored in a linked list. 